Discrete dipole approximation in time domain through the Laplace transform
نویسندگان
چکیده
منابع مشابه
Discrete dipole approximation in time domain through the Laplace transform.
We present a form of the discrete dipole approximation for electromagnetic scattering computations in time domain. We show that the introduction of complex frequencies, through the Laplace transform, significantly improves the computation time. We also show that the Laplace transform and its inverse can be combined to extract the field inside a scatterer at a real resonance frequency.
متن کاملSampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملRadiation forces in the discrete-dipole approximation.
The theory of the discrete-dipole approximation (DDA) for light scattering is extended to allow for the calculation of radiation forces on each dipole in the DDA model. Starting with the theory of Draine and Weingartner [Astrophys. J. 470, 551 (1996)] we derive an expression for the radiation force on each dipole. These expressions are reformulated into discrete convolutions, allowing for an ef...
متن کاملDiscrete dipole approximation for time-domain computation of optical forces on magnetodielectric scatterers.
We present a general approach, based on the discrete dipole approximation (DDA), for the computation of the exchange of momentum between light and a magnetodielectric, three-dimensional object with arbitrary geometry and linear permittivity and permeability tensors in time domain. The method can handle objects with an arbitrary shape, including objects with dispersive dielectric and/or magnetic...
متن کاملImprovements of the Discrete Dipole Approximation method
We report improvements in complex conjugate gradient algorithms applied to the discrete dipole approximation (DDA). It is shown that computational time is reduced by using the BiCGSTAB version of the CG algorithm, with diagonal left preconditioning.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2013
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.88.063303